Percolation Games
نویسندگان
چکیده
This paper introduces a discrete-time stochastic game class on [Formula: see text], which plays the role of toy model for well-known problem homogenization Hamilton–Jacobi equations. Conditions are provided under n-stage value converges as n tends to infinity, and connections with theory discussed. Funding: The second author acknowledges support French Agence Nationale de la Recherche (ANR) [Grant ANR-21-CE40-0020] (CONVERGENCE project).
منابع مشابه
Percolation Games, Probabilistic Cellular Automata, and the Hard-core Model
Let each site of the square lattice Z be independently declared closed with probability p, and otherwise open. Consider the following game: a token starts at the origin, and the two players take turns to move it from its current site x to an open site in {x + (0, 1), x + (1, 0)}; if both these sites are closed, then the player to move loses the game. Is there positive probability that the game ...
متن کاملInvasion Percolation in Presence of Gravity
Simultaneous capillary dominated displacement of the wetting and non-wetting phases are processes of interest in many disciplines including modeling of the penetration of polluting liquids in hydrology or the secondary migration in petroleum reservoir engineering. Percolation models and in particular invasion percolation is well suited to characterize the slow immiscible displaceme...
متن کاملWater Flooding Performance Evaluation Using Percolation Theory
Water flooding is a well-known secondary mechanism for improving oil recovery. Conventional approach to evaluate the performance of a water flooding process (e.g. breakthrough and post breakthrough behavior) is to establish a reliable geological reservoir model, upscale it, and then perform flow simulations. To evaluate the uncertainty in the breakthrough time or post breakthrough behavior, thi...
متن کاملInterference percolation
Let G be an infinite connected graph with minimum degree δ and maximum degree ∆. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, 0 < p < 1, and let G≤k p be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp. We show that if δ ≥ 6 and ∆/δ is not too large then G≤3 p almost surely h...
متن کاملLilypad Percolation
Let r be a nonnegative real number. Attach a disc of radius r to infinitely many random points (including the origin). Lilypad percolation asks whether we can reach infinity from the origin by walking through ‘lilypads’, that is, moving from one disc to another only if the discs overlap. In this paper, we explain what we mean by infinitely many random points, giving a definition of a Poisson Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2022
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2022.1334